Synthesis of Sparse Cylindrical Arrays Using Simulated Annealing Algorithm

نویسندگان

  • P. H. Xie
  • K. S. Chen
  • Z. S. He
چکیده

Abstract—In this paper, simulated annealing algorithm (SA) is applied to the synthesis of cylindrical conformal arrays in order to suppress the peaks of side lobes by acting on the elements’ positions. There are multiple optimization constraints including the number of elements, aperture and minimum element spacing. A constraint matrix is designed to make the solution meet the restriction on the minima distance between elements, and the individual matrix which forms on the basis of constraint matrix is used to express array configurations. The SA does not act on the elements’ positions directly but on the variables in a smaller solution space, this indirect description method makes the SA more computationally efficient. The simulation results confirm the great efficiency and robustness of the proposed method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Experience with sparse arrays at the University of Oslo

This paper gives an overview over work on layout and weight optimization of sparse 1D and 2D arrays which has been done over the last decade. The optimization methods have been linear programming, genetic methods and simulated annealing. The latter is our preferred method. The paper shows examples of optimized arrays on Cartesian and nonCartesian grids such as polar and hex. Non-planar arrays (...

متن کامل

SIMULATED ANNEALING ALGORITHM FOR SELECTING SUBOPTIMAL CYCLE BASIS OF A GRAPH

The cycle basis of a graph arises in a wide range of engineering problems and has a variety of applications. Minimal and optimal cycle bases reduce the time and memory required for most of such applications. One of the important applications of cycle basis in civil engineering is its use in the force method to frame analysis to generate sparse flexibility matrices, which is needed for optimal a...

متن کامل

Adaptive Simulated Annealing for Synthesis Design Space Exploration

This work has attempted to exploit information sharing to improve the results of Adaptive Simulated Annealing [1] as an optimization algorithm of the high-level synthesis of testable data paths. We have used Messengers [3] as a coordination tool to run several parallel instances of the annealing algorithm on the same design with di erent probability arrays for the perturbations. When all these ...

متن کامل

A Hierarchical View of the Search Space in the Data Path

This work has attempted to exploit information sharing to improve the results of Adaptive Simulated Annealing 1] as an optimization algorithm of the high-level synthesis of testable data paths. We have used Messengers 3] as a coordination tool to run several parallel instances of the annealing algorithm on the same design with diierent probability arrays for the perturbations. When all these in...

متن کامل

Optimizing Turning Parameters for Cylindrical Parts Using Simulated Annealing Method

In this paper, a simulated annealing algorithm has been developed to optimize machining parameters in turning operation on cylindrical workpieces. The turning operation usually includes several passes of rough machining and a final pass of finishing. Seven different constraints are considered in a non-linear model where the goal is to achieve minimum total cost. The weighted total cost consists...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009